New Iterative Solvers for the NAG Libraries
نویسندگان
چکیده
منابع مشابه
An Evaluation of New NAG Library Solvers for Large Sparse Symmetric Linear Systems
This report presents experimental results for new NAG Fortran Library software for the solution of large sparse symmetric linear systems of algebraic equations Preconditioned conjugate gradient methods introduced at Mark are compared against iterative and direct methods previously available in the library Test problems include discrete approximations to d elliptic partial di erential equations ...
متن کاملKernels for Distributed Memory Sparse Iterative Solvers ?
Domain Decomposition techniques constitute an important class of methods especially appropriate in a parallel computing environment, but only a few general purpose codes based on these techniques have been developed so far. In this work, we attempt to develop not only algorithms but also software libraries and tools to help in the parallel implementation of such techniques. These algorithms and...
متن کاملImplementation of Interior-point Methods for Lp Based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning∗
We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning of linear equations solved in the final phase of interior-point iterations. The employed Krylov subspace methods do not suffer from rank-defici...
متن کاملAn Evaluation of New NAG Library Solvers for Large Sparse Unsymmetric Linear Systems
This report presents an experimental comparison of NAG Fortran Library software for the solution of large sparse unsymmetric linear systems of algebraic equations Preconditioned RGMRES CGS and Bi CGSTAB methods to be introduced at Mark are compared against one another and against direct methods Test problems include discrete approximations to D elliptic partial di erential equations random valu...
متن کاملNon-stationary iterative solvers on a PC cluster
In this study, we introduce cost effective strategies and algorithms for parallelizing the Krylov subspace based non-stationary iterative solvers such as Bi-CGM and Bi-CGSTAB for distributed computing on a cluster of PCs using ANULIB message passing libraries. We investigate the effectiveness of the parallel solvers on the linear systems resulting in numerical solution of some 2D and 3D nonline...
متن کامل